Acceptance Conditions for ω-Languages
نویسندگان
چکیده
This paper investigates acceptance conditions for nite automata recognizing ω-regular languages. Their expressive power and their position w.r.t. the Borel hierarchy is also studied. The full characterization for the conditions (ninf,u), (ninf,⊆) and (ninf,=) is given. The nal section provides a partial characterization of (fin,=).
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملAcceptance conditions for omega-languages and the Borel hierarchy
This paper investigates acceptance conditions for finite automata recognizing ω-regular languages. As a first result, we show that, under any acceptance condition that can be defined in the MSO logic, a finite automaton can recognize at most ω-regular languages. Starting from this, the paper aims at classifying acceptance conditions according to their expressive power and at finding the exact p...
متن کاملTiling Systems over Infinite Pictures and Their Acceptance Conditions
Languages of infinite two-dimensional words (infinite ω-pictures) are studied in the automata theoretic setting of tiling systems. We show that a hierarchy of acceptance conditions as known from the theory of ω-languages can be established also over pictures. Since the usual pumping arguments fail, new proof techniques are necessary. Finally, we show that (unlike the case of ω-languages) none o...
متن کاملFinitary Languages
The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...
متن کاملOn Omega-Languages Defined by Mean-Payoff Conditions
In quantitative verification, system states/transitions have associated payoffs, and these are used to associate mean-payoffs with infinite behaviors. In this paper, we propose to define ω-languages via Boolean queries over mean-payoffs. Requirements concerning averages such as “the number of messages lost is negligible” are not ω-regular, but specifiable in our framework. We show that, for clo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012